翻訳と辞書 |
Decisional Diffie–Hellman assumption : ウィキペディア英語版 | Decisional Diffie–Hellman assumption The decisional Diffie–Hellman (DDH) assumption is a computational hardness assumption about a certain problem involving discrete logarithms in cyclic groups. It is used as the basis to prove the security of many cryptographic protocols, most notably the ElGamal and Cramer–Shoup cryptosystems. ==Definition==
Consider a (multiplicative) cyclic group of order , and with generator . The DDH assumption states that, given and for uniformly and independently chosen , the value "looks like" a random element in . This intuitive notion is formally stated by saying that the following two probability distributions are computationally indistinguishable (in the security parameter, ): * , where and are randomly and independently chosen from . * , where are randomly and independently chosen from . Triples of the first kind are often called DDH triples or DDH tuples.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Decisional Diffie–Hellman assumption」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|